[20251218] BOJ / G5 / A와 B / 강신지 #1705
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
🧷 문제 링크
https://www.acmicpc.net/problem/12904
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
A와 B로만 이루어진 문자열 S, T가 있다.
아래 두 가지 연산으로 s에서 t를 만들 수 있는지 알아내라.
🔍 풀이 방법
T에서 S를 만들 수 있는지를 보면 된다.
제일 뒤의 문자가 A면 A를 빼고, B면 B 뺀뒤 뒤집는 것만 가능. S 문자열의 길이가 될 때까지 반복한뒤 두 문자열이 같은지에 따라 0 또는 1 출력.
⏳ 회고